Broadcasting Communication in High Degree Modified Chordal Rings Networks
نویسندگان
چکیده
منابع مشابه
Broadcasting Communication in High Degree Modified Chordal Rings Networks
The design of the interconnection network is one of the main research issues in distributed computing with regard to some specific parameters. This paper works on Modified Chordal Rings Degree Six (CHRm6) topology. Two broadcasting schemes for CHRm6 are proposed. The first scheme is for even source nodes and the second scheme is for odd source nodes. The proposed broadcasting schemes give upper...
متن کاملCombinatorial Properties of Modified Chordal Rings Degree Four Networks
Problem statement: Modified Chordal Rings Degree Four, called CHRm4 is the first modified structure of chordal rings. This CHRm4 is an undirected circulant graph and is a double loop graph. Approach: This study presented the main properties of CHRm4. There are connectivity, Hamiltonian cycle and asymmetric. Results: Several definitions, postulates, corollary, theorems and lemmas were constructe...
متن کاملBroadcasting in generalized chordal rings
Broadcasting is an information dissemination process in which a message originating at one node of a communication network (modeled as an undirected graph) is sent to all other nodes by means of calls involving two nodes at a time, with each node participating in at most one call at any time. We are interested in efficient broadcasting in a class of cubic graphs known as generalized chordal rin...
متن کاملDistances in Generalized Double Rings and Degree Three Chordal Rings
Generalized Double Rings (N2R) are compared to Degree Three Chordal Rings (CR) in terms of average distance, diameter, k-average distance and k-diameter. For each number of nodes, structures of each class are chosen to minimize diameter and average distance, an approach which is shown to result in all other parameters being either minimized or nearly minimized. Average distance and diameter are...
متن کاملCompact Routing on Chordal Rings of Degree Four yLata
A chordal ring G(n; c) of degree 4 is a ring of n nodes with chords connecting each vertex i to the vertex (i + c) mod n. In this paper, we investigate compact routing schemes on such networks. We show a routing scheme for any such network that requires O(log n) bits of storage at each node, and O(1) time to compute a shortest path to any destination. This improves on the results of 16] which g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics & Information Sciences
سال: 2014
ISSN: 1935-0090,2325-0399
DOI: 10.12785/amis/080128